Constructing Exponential-Size Deterministic Zielonka Automata
نویسندگان
چکیده
The well-known algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka’s algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton).
منابع مشابه
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply expo...
متن کاملAsynchronous Cellular Automata and Logic for Pomsets without Auto-concurrency
This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Our main result generalizes Buchi's theorem for nite words t...
متن کاملAsynchronous Games over Tree Architectures
We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of finite processes communicating via shared actions and evolving asynchronously. Most importantly, processes participating in a shared action can exchange complete information about their causal past. This gives more power to controllers, and avoids simple pathological u...
متن کاملAsynchronous cellular automata for pomsets
This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Then we investigate the relation between t...
متن کاملThe Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata
We study the size-cost of boolean operations on constant height deterministic pushdown automata. We prove an asymptotically optimal exponential blow-up for union and intersection, as well as polynomial blow-up for complement.
متن کامل